A Flow Formulation for the Optimum Communication Spanning Tree
نویسندگان
چکیده
منابع مشابه
A Flow Formulation for the Optimum Communication Spanning Tree
In this paper we address the Optimum Communication Spanning Tree Problem. We present a formulation that uses three index variables and we propose several families of inequalities, which can be used to reinforce the formulation. Preliminary computational experiments are very promising.
متن کاملApproximation Algorithms for Some Optimum Communication Spanning Tree Problems
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning tree (PROCT) problem is to nd a spanning tree T minimizing ∑ u; v∈ V r(u)r(v)dT (u; v), where dT (u; v) is the length of the path between u and v on T . The optimal sum-requirement communication spanning tree (SROCT) pr...
متن کاملImproved Local Search for Large Optimum Communication Spanning Tree Problems
The Optimum Communication Spanning Tree (OCST) [2] problem is NP-hard and describes the problem of finding a spanning tree that minimizes the cost defined by edge weights and communication demands, routing all communication over this tree. Given a graph G = (V,E), a distance function d : E → R+ and a requirement function r : V ×V → R+, a spanning tree T ⊆ G is wanted minimizing the cost c(T ) =...
متن کاملOptimum Communication Spanning Trees
Given a set of nodes N (i 1, 2, ..., n) which may represent cities and a set of requirements ria which may represent the number of telephone calls between N and N j, the problem is to build a spanning tree connecting these n nodes such that the total cost of communication of the spanning tree is a minimum among all spanning trees. The cost of communication for a pair of nodes is r;a multiplied ...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2013
ISSN: 1571-0653
DOI: 10.1016/j.endm.2013.05.079